An Approach to Scheduling Bursty Traffic
نویسنده
چکیده
© 2014 Mahmoud Daneshvar Farzanegan et al. 69 http://dx.doi.org/10.4218/etrij.14.0112.0524 The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.
منابع مشابه
Bursty Traffic Meets Fading: A Cross-Layer Design Perspective∗
We study cross-layer optimization of transmitting bursty traffic over fading channels. A common theme is to exploit (rather than combat) channel variation and traffic burstiness. Specifically, for bursty data transmissions in CDMA networks, we identify the existence of a nontrivial predictive multi-access interference (MAI) temporal structure in such systems. The predictive MAI structure is uti...
متن کاملA New Analytical Model for the CQ Switch Performance Analysis under the Bursty Traffic
In this letter we propose a new analytical iterative method for calculating the throughput and average cell latency of the crosspoint queued switch with random scheduling algorithm under the bursty traffic model. This method is verified by comparing it with simulation results, which shows a very good match. To the authors’ knowledge, this is the first analytical method for performance analysis ...
متن کاملLoad Balancing in Internet Using Adaptive Packet Scheduling and Bursty Traffic Splitting
In this paper, we propose an architecture for load balancing, which contains an adaptive packet scheduler with a bursty traffic splitting algorithm. The scheduler has one classifier which classifies the flows into aggressive and normal flow. Aggressive flows are treated as high priority flows. Based on the buffer occupancy threshold, a trigger handler checks for load unbalance of the network an...
متن کاملBirkhoff-von-Neumann Switches with Deflection-Compensated Mechanism
Despite the high throughput and low complexity achieved by input scheduling based on Birkhoff-von-Neumann (BvN) decomposition; the performance of the BvN switch becomes less predictable when the input traffic is bursty. In this paper, we propose a deflection-compensated BvN (D-BvN) switch architecture to enhance the quasi-static scheduling based on BvN decomposition. The D-BvN switches provide ...
متن کاملUbiquitous fair bandwidth allocation for multimedia traffic on a WiMAX mesh network with multi-channels
The WiMAX, also known as IEEE 802.16, provides a mechanism for deploying high-speed wireless mesh network, (an ubiquitous wireless network) in metropolitan areas. WiMAX technology can be used as “last mile ubiquitous” broadband connections to deliver streaming audio or video to clients. Thus, Quality of Service (QoS) is very important for WiMAX networks. Providing QoS in multi-hop WiMAX network...
متن کامل